Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
391	C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2010, Article 4, pages 1–13 http://cjtcs.cs.uchicago.edu/ S PECIAL ISSUE FOR CATSOn Process Complexity Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 15:57:59 Tau Computability theory Descriptive complexity Kolmogorov complexity
392	On Models and Query Languages for Probabilistic Processes ∗ Daniel Deutch Tova Milo Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2010-09-30 07:59:25 Computability theory FO Finite model theory Mathematics Directed acyclic graph Bin ELEMENTARY SQL Complexity classes Applied mathematics Computing
393	A Turing Machine Resisting Isolated Bursts Of Faults Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-03-28 00:33:04 Computability theory Models of computation Computer science Alan Turing Formal methods Computational complexity theory Cellular automaton Non-deterministic Turing machine Busy beaver Turing machine Theory of computation Theoretical computer science
394	Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-04-27 00:54:51 Computability theory Analysis of algorithms Descriptive complexity Kolmogorov complexity Bounded-error probabilistic polynomial FO PP IP Time complexity Theoretical computer science Computational complexity theory Applied mathematics
395	Distributing Frequency-Dependent Data Stream Computations Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 16:56:01 Combinatorics Permutation Streaming algorithm Computability theory Normal distribution Algorithms Mathematics Abstract algebra
396	DEPTH (QUALIFIER) EXAMINATION IN THEORY OF COMPUTATION AND ALGORITHMS Spring, 2007 Automata, Languages and Complexity: 1. Regular languages (a) finite state automata (deterministic, nondeterministic) Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-02-09 21:44:57 Computability theory Models of computation Theory of computation Complexity classes John Hopcroft Alfred Aho Halting problem Turing machine Algorithm Theoretical computer science Applied mathematics Computer science
397	δ-uniform BSS Machines Paolo Boldi* Sebastiano Vigna∗ Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy. Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:52:47 Computer science Theory of computation Models of computation Alan Turing Turing machine Computable number Computability Reduction NP Theoretical computer science Computability theory Applied mathematics
398	A BASIS FOR A MATHEMATICAL THEORY OF COMPUTATION∗ JOHN McCARTHY 1961–1963 [This 1963 paper was included in Computer Programming and Formal Systems, edited by P. Braffort and D. Hirshberg and published by North-Hollan Add to Reading List Source URL: www-formal.stanford.edu Language: English - Date: 2002-03-26 18:08:23 Theoretical computer science Theory of computation Functions and mappings Function Computable function Logical connective Computability Indeterminate form Universal quantification Computability theory Mathematics Mathematical logic
399	seminarTEXT / prof. dr. eberhard von goldammer / ssLecture to the London Mathematieal Society on 20 February 1947 [ ] A. M. Turing The automatic computing engine now being designed at N.P.L. is a typical large Add to Reading List Source URL: www.vordenker.de Language: English* - Date: 2011-08-27 06:48:32 Computer hardware Computability theory Theoretical computer science Computer ENIAC Bit Binary-coded decimal Manchester Small-Scale Experimental Machine Computing Classes of computers Turing machine
400	Recursion in C What does the following program compute? int f(int n, int v) { if (n == 0) return v; else Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2009-02-04 16:35:18 Recursion Programming idioms Subroutines Computability theory Theoretical computer science Infinite loop Scheme Tail call Factorial Computer programming Software engineering Computing

UPDATE